By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 16, Issue 6, pp. 973-1164

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Three Partition Refinement Algorithms

Robert Paige and Robert E. Tarjan

pp. 973-989

BibTeX  Abstract Full Text:  PDF

Optimal Parallel Sorting Scheme by Order Statistics

Mark C. K. Yang, Jun S. Huang, and Yuan-Chieh Chow

pp. 990-1003

BibTeX  Abstract Full Text:  PDF

Fast Algorithms for Shortest Paths in Planar Graphs, with Applications

Greg N. Federickson

pp. 1004-1022

BibTeX  Abstract Full Text:  PDF

An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$

Alistair Moffat and Tadao Takaoka

pp. 1023-1031

BibTeX  Abstract Full Text:  PDF

Sorting and Selecting in Rounds

Nicholas Pippenger

pp. 1032-1038

BibTeX  Abstract Full Text:  PDF

Generalized String Matching

Karl Abrahamson

pp. 1039-1051

BibTeX  Abstract Full Text:  PDF

On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients

A. M. Frieze

pp. 1052-1072

BibTeX  Abstract Full Text:  PDF

Padded Lists Revisited

Micha Hofri and Alan G. Konheim

pp. 1073-1114

BibTeX  Abstract Full Text:  PDF

Height Restricted Optimal Binary Trees

Lawrence L. Larmore

pp. 1115-1123

BibTeX  Abstract Full Text:  PDF

Almost Sure Fault Tolerance in Random Graphs

Edward R. Scheinerman

pp. 1124-1134

BibTeX  Abstract Full Text:  PDF

On One-Way Cellular Arrays

Oscar H. Ibarra and Tao Jiang

pp. 1135-1154

BibTeX  Abstract Full Text:  PDF

A Queueing Analysis of Hashing with Lazy Deletion

John A. Morrison, Larry A. Shepp, and Christopher J. Van Wyk

pp. 1155-1164

BibTeX  Abstract Full Text:  PDF